Optimization Models for a Deteriorating Single Server Queuing Production System

Authors

  • Arash Motaghedi Larijani Department of Industrial Engineering, Iran University of science & technology, Narmak, Tehran, Iran
  • Kamyar Sabri Laghaie Department of Industrial Engineering, Iran University of science & technology, Narmak, Tehran, Iran
  • Mohammad Saidi Mehrabad Department of Industrial Engineering, Iran University of science & technology, Narmak, Tehran, Iran
Abstract:

 In this paper a single server queuing production system is considered which is subject to gradual deterioration. The system is discussed under two different deteriorating conditions. A planning horizon is considered and server which is a D/M/1 queuing system is gradually deteriorates through time periods. A maintenance policy is taken into account whereby the server is restored to its initial condition before some distinct periods. This system is modeled to obtain optimal values of arrival rates and also optimal maintenance policy which minimizes production, holding and maintenance costs and tries to satisfy demands through time periods. The model is also considered to control customers’ sojourn times. For each deteriorating condition a model is developed. Models are solved by GA based algorithms and results for a sample are represented .

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

optimization models for a deteriorating single server queuing production system

in this paper a single server queuing production system is considered which is subject to gradual deterioration. the system is discussed under two different deteriorating conditions. a planning horizon is considered and server which is a d/m/1 queuing system is gradually deteriorates through time periods. a maintenance policy is taken into account whereby the server is restored to its initial c...

full text

Single server queuing model pdf

Queuing theory is the study of queues for managing process and objects. In this paper we analyze various models of the Single server queuing system with.Single-sever service node consists of a server plus its queue. If only one service technician, the machine shop model from section 1. 1 is a single-server queue.Queueing theory is the mathematical study of waiting lines, or queues. The MM1 queu...

full text

A Comparison of Single Server and Multiple Server Queuing Models in Different Departments of Hospitals

Queuing theory is the branch of Operations research in applied mathematics and deals with phenomenon of waiting lines. Queuing theory is concerned with the mathematical modeling and analysis of systems which provides service to random demands. In this paper, we have focused the applications of queuing theory in the field of healthcare (hospital) i.e. one of the biological paradigm. The health s...

full text

Finite Capacity Queuing System with Vacations and Server Breakdowns

This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...

full text

A single server perishable inventory system with N additional options for service

This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...

full text

A simulation algorithm for a single server retrial queuing system with batch arrivals

Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases. The paper presents a study approach for this kind of systems, based on discrete event simulation. It is shown that the given algorithm has a polynomial complexity. Also, the object-oriented design we used for implem...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 22  issue 4

pages  251- 260

publication date 2011-12

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023